On the converse theorem in statistical hypothesis testing
نویسندگان
چکیده
Discussion on the converse theorem in statistical hypothesis testing. Hypothesis testing for two Markov chains is considered. Under the constraint that the first-kind error probability is less than or equal to exp( T R ), the second-kind error probability is minimized. The geodesic that connects the two Markov chains is defined. By analyzing the geodesic, the power exponents are calculated and then represent in terms of Kullback-Leibler divergence. Zndex TermsHypothesis testing, Markov chain, randomized test, information geometry, geodesic, power exponent, converse theorem.
منابع مشابه
The Converse Part of The Theorem for Quantum Hoeffding Bound
We prove the converse part of the theorem for quantum Hoeffding bound on the asymptotics of quantum hypothesis testing, essentially based on an argument developed by Nussbaum and Szkola in proving the converse part of the quantum Chernoff bound. Our result complements Hayashi’s proof of the direct (achievability) part of the theorem, so that the quantum Hoeffding bound has now been established.
متن کاملTESTING STATISTICAL HYPOTHESES UNDER FUZZY DATA AND BASED ON A NEW SIGNED DISTANCE
This paper deals with the problem of testing statisticalhypotheses when the available data are fuzzy. In this approach, wefirst obtain a fuzzy test statistic based on fuzzy data, and then,based on a new signed distance between fuzzy numbers, we introducea new decision rule to accept/reject the hypothesis of interest.The proposed approach is investigated for two cases: the casewithout nuisance p...
متن کاملSome Results on Baer's Theorem
Baer has shown that, for a group G, finiteness of G=Zi(G) implies finiteness of ɣi+1(G). In this paper we will show that the converse is true provided that G=Zi(G) is finitely generated. In particular, when G is a finite nilpotent group we show that |G=Zi(G)| divides |ɣi+1(G)|d′ i(G), where d′i(G) =(d( G /Zi(G)))i.
متن کاملStrong Converse, Feedback Channel Capacity and Hypothesis Testing
In light of recent results by Verd u and Han on channel capacity, we examine three problems: the strong converse condition to the channel coding theorem, the capacity of arbitrary channels with feedback and the Neyman-Pearson hypothesis testing type-II error exponent. It is rst remarked that the strong converse condition holds if and only if the sequence of normalized channel information densit...
متن کاملStatistical Hypothesis Testing and Lower Bounds to the Error Probability
Two alternative exact characterizations of the minimum error probability of Bayesian M -ary hypothesis testing are derived. The first expression corresponds to the error probability of an induced binary hypothesis test and implies the tightness of the meta-converse bound by Polyanskiy, Poor and Verdú; the second expression is function of an information-spectrum measure and implies the tightness...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Information Theory
دوره 39 شماره
صفحات -
تاریخ انتشار 1993